Mean equicontinuity and mean sensitivity on cellular automata
نویسندگان
چکیده
منابع مشابه
Mean Field Models of Probabilistic Cellular Automata
Probabilistic cellular automata (PCA) form a very large and general class of stochastic processes. These automata exhibit a wide range of complicated behavior and are of interest in a number of fields of study, including mathematical physics, percolation theory, computer science, and neurobiology. The models are generally considered on the lattice Z (usually in two dimensions). Very little has ...
متن کاملOn undecidability of equicontinuity classification for cellular automata
Cellular automata are simple model for the study of complex phenomena produced by simple local interactions. They consist of a regular lattice of cells. Each cell contain finite automaton which has a state chosen from a finite set of states. Updates are made according to a local rule which takes into account the current state of the cell and those of a fixed finite set of its neighboring cells....
متن کاملLarge deviations for mean field models of probabilistic cellular automata
Probabilistic cellular automata (PCA) form a very large and general class of stochastic processes. These automata exhibit a wide range of complex behavior and are of interest in a number of fields of study, including mathematical physics, percolation theory, computer science, and neurobiology. Very little has been proved about these models, even in simple cases, so it is common to compare the m...
متن کاملSome properties of cellular automata with equicontinuity points
We investigate topological and ergodic properties of cellular automata having equicontinuity points. In this class surjectivity on a transitive SFT implies existence of a dense set of periodic points. Our main result is that under the action of such an automaton any shift–ergodic measure converges in Cesàro mean, assuming equicontinuity points have measure 1; the limit measure is described by a...
متن کاملMean-Payoff Games on Timed Automata
Mean-payoff games on timed automata are played on the infinite weighted graph of configurations of priced timed automata between two players—Player Min and Player Max—by moving a token along the states of the graph to form an infinite run. The goal of Player Min is to minimize the limit average weight of the run, while the goal of the Player Max is the opposite. Brenguier, Cassez, and Raskin re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ergodic Theory and Dynamical Systems
سال: 2020
ISSN: 0143-3857,1469-4417
DOI: 10.1017/etds.2020.108